Towards Experimental Nanosound Using Almost Disjoint Set Theory
نویسنده
چکیده
Music composition using digital audio sequence editors is increasingly performed in a visual workspace where sound complexes are built from discrete sound objects, called gestures that are arranged in time and space to generate a continuous composition. The visual workspace, common to most industry standard audio loop sequencing software, is premised on the arrangement of gestures defined with geometric shape properties. Here, one aspect of fractal set theory was validated using audio-frequency sets to evaluate self-affine scaling behavior when new sound complexes are built through union and intersection operations on discrete musical gestures. Results showed that intersection of two sets revealed lower complexity compared with the union operator, meaning that the intersection of two sound gestures is an almost disjoint set, and in accord with formal logic. These results are also discussed with reference to fuzzy sets, cellular automata, nanotechnology and self-organization to further explore the link between sequenced notation and complexity.
منابع مشابه
Remarks on a Class of Almost Disjoint Families
We study the relationship between several closely related m.a.d. families in several forcing models. We also prove some ZFC result concerning the lower bound of these m.a.d. families, which answers a question suggested by Stevo Todorcevic. In the last section, we state several open problems in this area. 1. Almost Disjoint Families We Study Studying the concept of almost disjoint (a.d.) familie...
متن کاملReliability assessment of power distribution systems using disjoint path-set algorithm
Finding the reliability expression of different substation configurations can help design a distribution system with the best overall reliability. This paper presents a computerized a nd implemented algorithm, based on Disjoint Sum of Product (DSOP) algorithm. The algorithm was synthesized and applied for the first time to the determination of reliability expression of a substation to determine...
متن کاملOn Sets of Almost Disjoint Subsets of a Set
The cardinal power of a set A is denoted by IA . Two sets A,, A2 are said to e almost disjoint if IA1 U A2I < lA i l (i = 1, 2) . e call B a transversal of the disjoint non-empty sets A,, (v E M) if Bc U A,, and B intersects each A,. (v E M) in a singleton . D1 An old and well known theorem of W . SIERPINSKI is that an infinite set of po-ver m contains more than m subsets of power m which are p...
متن کاملA Model with No Strongly Separable Almost Disjoint Families
We answer a question of Shelah and Steprāns [6] by producing a model of ZFC where there are no strongly separable almost disjoint families. The notion of a strongly separable almost disjoint family is a natural variation on the well known notion of a completely separable almost disjoint family, and is closely related to the metrization problem for countable Fréchet groups.
متن کاملSplitting Families and Complete Separability
The purpose of this short note is to answer a question posed by the second and third authors in [5] and to use this to solve a problem of Shelah [6]. We say that two infinite subsets a and b of ω are almost disjoint or a.d. if a∩ b is finite. We say that a family A of infinite subsets of ω is almost disjoint or a.d. if its members are pairwise almost disjoint. A Maximal Almost Disjoint family, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره cs.SD/0203015 شماره
صفحات -
تاریخ انتشار 2002